Design of LDPC Codes Without Trapping Set TS(5,3) with minimizing TS(6,4)
نویسنده
چکیده
Design of binary LDPC codes with very low error floors is still a significant problem. Progressive Edge-Growth (P.E.G) original is a well known algorithm for constructing bipartite graphs with good girth properties. In this paper, we propose a characterization of the trapping set TS(5,3) and a cost function in P.E.G that allows to build regular girth 8 LDPC codes free of TS(5,3). We illustrate the interest of eliminating the trapping set TS(5,3) and minimizing TS(6,4) with simulation results.
منابع مشابه
Protograph-Based Generalized LDPC Codes: Enumerators, Design, and Applications
Among the recent advances in the area of low-density parity-check (LDPC) codes, protograph-based LDPC codes have the advantages of a simple design procedure and highly structured encoders and decoders. These advantages can also be exploited in the design of protograph-based generalized LDPC (G-LDPC) codes. In this dissertation we provide analytical tools which aid the design of protographbased ...
متن کاملEnsemble Trapping Set Enumerators for Protograph-Based LDPC Codes
Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. Recently, techniques for finding asymptotic trapping set enumerators in regular and irregular LDPC code ensembles was published [1]. In this paper, finite-length ensemble trapping set enumerators for protographbased LDPC codes are obtained. The asymptotic results...
متن کاملAsymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles
The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some combinatorial structures of the code’s Tanner graph, collectively referred to as trapping sets (TSs). In this paper, we study the asymptotic average number of different types of trapping sets such as elementary TSs (ETS), leafless ETSs (LETS), absorbing sets (ABS), elementary ABSs (EABS...
متن کاملAnalyse et construction de codes LDPC non-binaires pour des canaux à évanouissement. (Analysis and Design of Non-Binary LDPC Codes over Fading Channels)
Over the last 15 years, spectacular advances in the analysis and design of graph-based codes and iterative decoding techniques paved the way for the development of error correction systems operating very close to the theoretical Shannon limit. A prominent role has been played by the class of Low Density Parity Check (LDPC) codes, introduced in the early 60's by Gallager's and described latter i...
متن کاملAn Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes
This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. The algorithm can be used to estimate the error floor of LDPC codes or to be used as a tool to design LDPC codes with low error floors. For regular codes, the algorithm is initiated with a set of short cycles as the input. For irregular codes, in addition to short cycles,...
متن کامل